An Axiomatic Theory of Inductive Inference

Inductive Inference: An Axiomatic Approach∗

A predictor is asked to rank eventualities according to their plausibility, based on past cases. We assume that she can form a ranking given any memory that consists of finitely many past cases. Mild consistency requirements on these rankings imply that they have a numerical representation via a matrix assigning numbers to eventuality-case pairs, as follows. Given a memory, each eventuality is ...

Towards Axiomatic Basis of Inductive Inference

The language for the formulation of the interesting statements is, of course, most important. We use first order predicate logic. Our main achievement in this paper is an axiom system which we believe to be more powerful than any other natural general purpose discovery axiom system. We prove soundness of this axiom system in this paper. Additionally we prove that if we remove some of the requir...

Inductive inference from theory laden data

An Axiomatic Theory of StateCharts

Executive Summary Statecharts provide for the detailed graphical description of real-time computing systems. Extended Real Time Logic (ERTL) provides for the axiomatic description of real-time computing systems. The StateMate tool provides powerful facilities for the construction and validation of Statecharts, using a conceptually simple graphical user interface. In this paper we develop a mapp...

An Axiomatic Theory of Fairness

The tradeoff between fairness and throughput has been widely observed in network analysis and protocol design. Despite many existing fairness metrics (from simple ones like Jain’s index to more complex ones like α-fair utility), the meaning of fairness is largely based on problemoriented interpretations and judgments, with no well-established framework. To tackle this challenging problem, we pr...